Three Dimensional Triangulations in Cgal
نویسنده
چکیده
This paper describes the design and the implementation of the three-dimensional trian-gulation package 1 of the Computational Geometric Algorithms Library Cgal 2. We focus on representation issues and especially insist on how the cases of degenerate dimensions are treated. The algorithmic issues are not examined in this short paper.
منابع مشابه
Triangulations in CGAL
This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library Cgal.
متن کاملDecoupling the CGAL 3D Triangulations from the Underlying Space
The Computational Geometry Algorithms Library Cgal currently provides packages to compute triangulations in R and R. In this paper we describe a new design for the 3D triangulation package that permits to easily add functionality to compute triangulations in other spaces. These design changes have been implemented, and validated on the case of the periodic space T. We give a detailed descriptio...
متن کاملParallel Multi-Core Geometric Algorithms in CGAL
We describe an approach to efficiently use multiple processing cores and shared memory for several geometric algorithms. The d-dimensional algorithms we target are (a) spatial sorting of points, (b) kd-tree construction, (c) axis-aligned box intersection computation, and finally (d) bulk insertion of points in Delaunay triangulations. Underlying these comes also a thread-safe, efficient and mem...
متن کاملSmoothed complexityof geometric structures and algorithms
Geometric problems are central in many areas of science and engineering. Computational geometry, the study of combinatorial and algorithmic problems in a geometric setting, and in particular triangulations have tremendous practical applications in areas such as computer graphics, computer vision and imaging, scientific visualization, geographic information systems, astronomy, computational biol...
متن کاملInternship proposal Walking in triangulation , probabilistic analysis
Geometric problems are central in many areas of science and engineering. Computational geometry, the study of combinatorial and algorithmic problems in a geometric setting, and in particular triangulations have tremendous practical applications in areas such as computer graphics, computer vision and imaging, scientific visualization, geographic information systems, astronomy, computational biol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999